“Melting” of complex networks. A mathematical model of complex networks resilience to external stress
نویسندگان
چکیده
منابع مشابه
Resilience of Complex Networks
This article determines and characterizes the minimal number of actuators needed to ensure structural controllability of a linear system under structural alterations that can severe the connection between any two states. We assume that initially the system is structurally controllable with respect to a given set of controls, and propose an efficient system-synthesis mechanism to find the minima...
متن کاملResilience of complex networks to random breakdown.
Using Monte Carlo simulations we calculate fc, the fraction of nodes that are randomly removed before global connectivity is lost, for networks with scale-free and bimodal degree distributions. Our results differ from the results predicted by an equation for fc proposed by Cohen We discuss the reasons for this disagreement and clarify the domain for which the proposed equation is valid.
متن کاملResilience of modular complex networks
Saray Shai, Dror Y. Kenett, Yoed N. Kenett, Miriam Faust, 4 Simon Dobson, and Shlomo Havlin 1School of Computer Science, University of St Andrews, St Andrews, Fife KY16 9SX, Scotland, UK 2Center for Polymer Studies and Department of Physics, Boston University, Boston, Massachusetts 02215, USA 3Gonda Brain Research Center, Bar-Ilan University, Ramat-Gan, Israel 4Department of Psychology, Bar-Ila...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملReinforcing the resilience of complex networks.
Given a connected network, it can be augmented by applying a growing strategy (e.g., random- or preferential-attachment rules) over the previously existing structure. Another approach for augmentation, recently introduced, involves incorporating a direct edge between any two nodes which are found to be connected through at least one self-avoiding path of length L. This work investigates the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2019
ISSN: 0096-3003
DOI: 10.1016/j.amc.2019.124579